Designing a New Particle Swarm Optimization for Make-with-Buy Inventory Model

نویسندگان

  • Saeed Poormoaied
  • Mahsa Yavari
چکیده

In real world, some manufacturing companies may encounter the production restriction. For instance, if the number of products increases, given company may not be able to produce all products. Therefore, it may encounter the backlogging. On the other hand, if product demand increases, given company may encounter restricted capacity to respond to such demands; so, it will also encounter backlogging. In this paper, we consider such companies that will encounter the mentioned conditions. To respond these exceeded demands, companies will be enforced to buy some products from outside. Therefore, the objective of this paper is to determine the optimum quantities of make and buy for each product by minimizing total inventory cost. We refer to the proposed model as make-with-buy model. In this paper we formulate the make-with-buy model and solve it by two meta-heuristic algorithms namely genetic algorithm (GA) and particle swarm optimization (PSO).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Mathematical Model in Cell Formation Problem with Consideration of Inventory and Backorder: Genetic and Particle Swarm Optimization Algorithms

Cell Formation (CF) is the initial step in the configuration of cell assembling frameworks. This paper proposes a new mathematical model for the CF problem considering aspects of production planning, namely inventory, backorder, and subcontracting. In this paper, for the first time, backorder is considered in cell formation problem. The main objective is to minimize the total fixed and variable...

متن کامل

Solving a new bi-objective model for a cell formation problem considering labor allocation by multi-objective particle swarm optimization

Mathematical programming and artificial intelligence (AI) methods are known as the most effective and applicable procedures to form manufacturing cells in designing a cellular manufacturing system (CMS). In this paper, a bi-objective programming model is presented to consider the cell formation problem that is solved by a proposed multi-objective particle swarm optimization (MOPSO). The model c...

متن کامل

Optimization of the Inflationary Inventory Control Model under Stochastic Conditions with Simpson Approximation: Particle Swarm Optimization Approach

In this study, we considered an inflationary inventory control model under non-deterministic conditions. We assumed the inflation rate as a normal distribution, with any arbitrary probability density function (pdf). The objective function was to minimize the total discount cost of the inventory system. We used two methods to solve this problem. One was the classic numerical approach which turne...

متن کامل

Software Cost Estimation by a New Hybrid Model of Particle Swarm Optimization and K-Nearest Neighbor Algorithms

A successful software should be finalized with determined and predetermined cost and time. Software is a production which its approximate cost is expert workforce and professionals. The most important and approximate software cost estimation (SCE) is related to the trained workforce. Creative nature of software projects and its abstract nature make extremely cost and time of projects difficult ...

متن کامل

A discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain

This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013